Compiling High-Level Type Constructors in Constraint Programming
نویسندگان
چکیده
We propose high-level type constructors for constraint programming languages, so that constraint satisfaction problems can be modelled in very expressive ways. We design a practical set constraint language, called esra, by incorporating these ideas on top of opl. A set of rewrite rules achieves compilation from esra into opl, yielding programs that are often very similar to those that a human opl modeller would (have to) write anyway, so that there is no loss in solving eeciency.
منابع مشابه
Design and Implementation of the GNU Prolog System
In this paper we describe the design and the implementation of the GNU Prolog system. This system draws on our previous experience of compiling Prolog to C in the wamcc system and of compiling finite domain constraints in the clp(FD) system. The compilation scheme has however been redesigned in order to overcome the drawbacks of compiling to C. In particular, GNU-Prolog is based on a low-level ...
متن کاملImplementing Temporal Type Constructors for Music Programming
Applied to musical DSP programming, temporal type constructors enable high-level expression of sample-level algorithms. However, realizing this promise is not trivial. This work explains why, and describes a practical realization. This realization presents a functional interface onto a back end of interlinked objects. Its speed is a factor of two to ten off that of C++.
متن کاملClp(b) : Combining Simplicity and Eeciency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver in the Constraint Logic Programming paradigm. This solver is based on local propagation methods and follows the \glass-box" approach of compiling high-level constraints into primitive low-level ones. We detail its integration into the WAM showing that the necessary extension is truly minimal since only four new ...
متن کاملclp(B): Combining Simplicity and Efficiency in Boolean Constraint Solving
We present the design and the implementation of clp(B): a boolean constraint solver inside the Constraint Logic Programming paradigm. This solver is based on local propagation methods and follows the “glass-box” approach of compiling high-level constraints into primitive low-level ones. We detail its integration into the WAM showing that the necessary extension is truly minimal since only four ...
متن کاملAHigh - Level Intermediate Language and the Algorithms for Compiling Finite - Domain Constraints 1
In this paper, we present a high-level intermediate language, called delay-Prolog, for implementing CLP(FD), the constraint language over nite-domains. Delay-Prolog has a much stronger description power than indexical, the intermediate language widely used in current nite-domain constraint compilers. It is powerful enough for describing all kinds of constraint propagation procedures, which by n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001